Faster Scalar Multiplication on Ordinary Weierstrass Elliptic Curves over Fields of Characteristic Three
نویسندگان
چکیده
This paper proposes new explicit formulae for the point doubling, tripling and addition on ordinary Weierstrass elliptic curves with a point of order 3 over finite fields of characteristic three. The cost of basic point operations is lower than that of all previously proposed ones. The new doubling, mixed addition and tripling formulae in projective coordinates require 3M + 2C, 8M + 1C + 1D and 4M + 4C + 1D respectively, where M , C and D is the cost of a field multiplication, a cubing and a multiplication by a constant. We also provide the unified and complete group laws. Finally, we present several examples of ordinary elliptic curves in characteristic three for high security levels.
منابع مشابه
Fast Algorithm for Converting Ordinary Elliptic Curves into Binary Edward Form
Scalar multiplication is computationally the most expensive operation in elliptic curve cryptosystems. Many techniques in literature have been proposed for speeding up scalar multiplication. In 2008, Bernstein et al proposed binary Edwards curves on which scalar multiplication is faster than traditional curves. At Crypto 2009, Bernstein obtained the fastest implementation for scalar multiplicat...
متن کاملSpeeding up Elliptic Curve Scalar Multiplication without Precomputation
This paper presents a series of Montgomery scalar multiplication algorithms on general short Weierstrass curves over odd characteristic fields, which need only 12 field multiplications plus 12 ∼ 20 field additions per scalar bit using 8 ∼ 10 field registers, thus significantly outperform the binary NAF method on average. Over binary fields, the Montgomery scalar multiplication algorithm which w...
متن کاملFaster Point Scalar Multiplication on Short Weierstrass Elliptic Curves over Fp using Twisted Hessian Curves over Fp2
This article shows how to use fast Fp2 arithmetic and twisted Hessian curves to obtain faster point scalar multiplication on elliptic curve ESW in short Weierstrass form over Fp . It is assumed that p and #ESW (Fp) are different large primes, #E(Fq) denotes number of points on curve E over field Fq and #E t SW (Fp), where E t is twist of E, is divisible by 3. For example this method is suitable...
متن کاملEfficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation
In the current work we propose two efficient formulas for computing the 5-fold (5P ) of an elliptic curve point P . One formula is for curves over finite fields of even characteristic and the other is for curves over prime fields. Double base number systems (DBNS) have been gainfully exploited to compute scalar multiplication efficiently in ECC. Using the proposed point quintupling formulas one...
متن کاملEfficient and side-channel-aware implementations of elliptic curve cryptosystems over prime fields
Elliptic curve cryptosystems (ECCs) are utilised as an alternative to traditional public-key cryptosystems, and are more suitable for resource-limited environments because of smaller parameter size. In this study, the authors carry out a thorough investigation of side-channel attack aware ECC implementations over finite fields of prime characteristic including the recently introduced Edwards fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2011 شماره
صفحات -
تاریخ انتشار 2011